XX Incremental Bisimulation Abstraction Refinement
نویسندگان
چکیده
ion refinement techniques in probabilistic model checking are prominent approaches to the verification of very large or infinite-state probabilistic concurrent systems. At the core of the refinement step lies the implicit or explicit analysis of a counterexample. This paper proposes an abstraction refinement approach for the probabilistic computation tree logic (PCTL), which is based on incrementally computing a sequence of mayand must-quotient automata. These are induced by depth-bounded bisimulation equivalences of increasing depth. The approach is both sound and complete, since the equivalences converge to the genuine PCTL equivalence. Experimental results with a prototype implementation show the effectiveness of the approach.
منابع مشابه
Approximate Bisimulation Equivalence and Variable Refinement
In this paper, we consider an operator for refinement of variables to be used in the design of hybrid system. Variables on a given level of abstraction are replaced by more complicated processes on a lower level just like the function are called in the program. Then we established the equivalence, bisimulation equivalence and approximate bisimulation equivalence which are by polynomial flow eve...
متن کاملVertical Implementation
We investigate criteria to relate specifications and implementations belonging to conceptually different levels of abstraction. For this purpose, we introduce the generic concept of a vertical implementation relation, which is a family of binary relations indexed by a refinement function that maps abstract actions onto concrete processes and thus determines the basic connection between the abst...
متن کاملA logic for n-dimensional hierarchical refinement
Hierarchical transition systems provide a popular mathematical structure to represent state-based software applications in which different layers of abstraction are represented by inter-related state machines. The decomposition of high level states into inner sub-states, and of their transitions into inner sub-transitions is common refinement procedure adopted in a number of specification forma...
متن کاملModel Checking with Formula-Dependent Abstract Models
Abstract. We present a model checking algorithm for CTL (and full CTL) which uses an iterative abstraction refinement strategy. In each iteration we call a standard model checker for the abstract models i. If i does not satisfy Φ we refine the abstract model i yielding another abstract model i 1 and (re-)call the model checker to i 1. Otherwise the formula holds for the original system . Our al...
متن کاملIncremental Materialization Update via Abstraction Refinement
ion Refinement Markus Brenner and Birte Glimm University of Ulm, Germany, [email protected] Abstract. Abstraction refinement is a recently introduced technique Abstraction refinement is a recently introduced technique which allows for reducing materialization of an ontology with a large ABox to materialization of a smaller (compressed) ‘abstraction’ of this ontology. In this p...
متن کامل